Fully Anonymous Profile Matching In Mobile Social Networks
ثبت نشده
چکیده
In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparison-based matching result about a specified attribute in their profiles, while preventing their attribute values from disclosure. We then propose an implicit Comparison-based Profile Matching protocol (iCPM) which allows the initiator to directly obtain some messages instead of the comparison result from the responder. The messages unrelated to user profile can be divided into multiple categories by the responder. The initiator implicitly chooses the interested category which is unknown to the responder. Two messages in each category are prepared by the responder, and only one message can be obtained by the initiator according to the comparison result on a single attribute. We further generalize the iCPM to an implicit Predicate-based Profile Matching protocol (iPPM) which allows complex comparison criteria spanning multiple attributes. The anonymity analysis shows all these protocols achieve the confidentiality of user profiles. In addition, the eCPM reveals the comparison result to the initiator and provides only conditional anonymity; the iCPM and the iPPM do not reveal the result at all and provide full anonymity. We analyze the communication overhead and the anonymity strength of the protocols.
منابع مشابه
Fully Anonymous Profile Matching in Mobile Social Networks
In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparisonbased matching result about a specif...
متن کاملUser Profile Matching with Privacy Preservation in Mobile Social Networks
In this paper, we study profile matching [1] with privacy-preservation in mobile social networks (MSNs) and introduce a novel profile matching protocols. Inter-social networks[2][3] operations and functionalities are required in several scenarios (data integration, data enrichment, information retrieval, etc.). To achieve this, matching user profiles is required. Current methods are so restrict...
متن کاملPrivacy preserving distributed profile matching in mobile social network
In this document, a privacy-preserving distributed profile matching protocol is proposed in a particular network context called mobile social network. Such networks are often deployed in more or less hostile environments, requiring rigorous security mechanisms. In the same time, energy and computational resources are limited as these heterogeneous networks are frequently constituted by wireless...
متن کاملA Semantics-based Approach to Large-Scale Mobile Social Networking
Mobile ad hoc social networks are selfconfiguring social networks that connect users using mobile devices, such as laptops, PDAs, and cellular phones. These social networks facilitate users to form virtual communities of similar interests or commonalities. This paper proposes semantics-based mobile social network (SMSN), a novel framework of a fully functional mobile ad hoc social network that ...
متن کاملSecure Profile Matching and Privacy Preserving In Mobile Social Network
As the increasing use of mobile devices, mobile social networks (MSNs) are becoming an inseparable part of peoples’ lives. In existing systems for such services, usually all the users directly publish their complete profiles for others to search. However in this paper we create a profile matching application which helps user to find the people whose profile best matches with others people. In t...
متن کامل